// 笔试强训day25：分割等和子集

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n = 0; cin >> n;
    vector<int> nums(n, 0);
    int sum = 0;
    for (auto& e : nums)
    {
        cin >> e;
        sum += e;
    }

    if (sum % 2 == 0)
    {
        int m = sum / 2;
        vector<vector<bool>> dp(n + 1, vector<bool>(m + 1, false));
        dp[0][0] = true;
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (nums[i - 1] == j)
                    dp[i][j] = true;
                else if (nums[i - 1] > j)
                    dp[i][j] = dp[i - 1][j];
                else
                    dp[i][j] = dp[i - 1][j - nums[i - 1]];
            }
        }
        if (dp[n][m])
        {
            cout << "true" << endl;
        }
        else
        {
            cout << "false" << endl;
        }
    }
    else
    {
        cout << "false" << endl;
    }
}